- pairwise combining
- объединение двух запросов (в вычислительной сети) в один-; парное объединение («спаривание») запросов; ср. также k-way combining
Англо-русский словарь промышленной и научной лексики. 2014.
pairwise combining
Смотреть что такое "pairwise combining" в других словарях:
Multiple sequence alignment — A multiple sequence alignment (MSA) is a sequence alignment of three or more biological sequences, generally protein, DNA, or RNA. In many cases, the input set of query sequences are assumed to have an evolutionary relationship by which they… … Wikipedia
Semantic similarity — or semantic relatedness is a concept whereby a set of documents or terms within term lists are assigned a metric based on the likeness of their meaning / semantic content. Concretely, this can be achieved for instance by defining a topological… … Wikipedia
Travelling salesman problem — The travelling salesman problem (TSP) is an NP hard problem in combinatorial optimization studied in operations research and theoretical computer science. Given a list of cities and their pairwise distances, the task is to find a shortest… … Wikipedia
Asian people — Asians redirects here. For a nomadic Central Asian people of antiquity, see Asii. For the individual peoples of Asia, see ethnic groups in Asia. For demographic data, see demography of Asia … Wikipedia
Vitali set — In mathematics, a Vitali set is an elementary example of a set of real numbers that is not Lebesgue measurable. The Vitali theorem is the existence theorem that there are such sets. It is a non constructive result. The naming is for Giuseppe… … Wikipedia
Differential structure — In mathematics, an n dimensional differential structure (or differentiable structure) on a set M makes M into an n dimensional differential manifold, which is a topological manifold with some additional structure that allows us to do differential … Wikipedia
Local consistency — In constraint satisfaction, local consistency conditions are properties of constraint satisfaction problems related to the consistency of subsets of variables or constraints. Several such conditions exist, the most known being node consistency,… … Wikipedia
Boolean algebras canonically defined — Boolean algebras have been formally defined variously as a kind of lattice and as a kind of ring. This article presents them more neutrally but equally formally as simply the models of the equational theory of two values, and observes the… … Wikipedia
Gossip protocol — A gossip protocol is a style of computer to computer communication protocol inspired by the form of gossip seen in social networks. Modern distributed systems often use gossip protocols to solve problems that might be difficult to solve in other… … Wikipedia
radioactivity — /ray dee oh ak tiv i tee/, n. Physics, Chem. the phenomenon, exhibited by and being a property of certain elements, of spontaneously emitting radiation resulting from changes in the nuclei of atoms of the element. Also called activity. [1895… … Universalium
Pythagorean theorem — See also: Pythagorean trigonometric identity The Pythagorean theorem: The sum of the areas of the two squares on the legs (a and b) equals the area of the square on the hypotenuse (c) … Wikipedia
